Allocation Rules for Games with Optimistic Aspirations
نویسندگان
چکیده
منابع مشابه
Allocation rules for network games
Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks) can and should influence the allocation of value among players on any given network structure. I pres...
متن کاملAllocation rules for coalitional network games
Coalitional network games are real-valued functions defined on a set of players organized into a network and a coalition structure. We adopt a flexible approach assuming that players organize themselves the best way possible by forming the efficient coalitional network structure. We propose two allocation rules that distribute the value of the efficient coalitional network structure: the atomba...
متن کاملA New Family of Allocation Rules for Network Games
Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks) can and should influence the allocation of value among players on any given network structure. I pres...
متن کاملFuzzy clan games and bi-monotonic allocation rules
In this paper the class of fuzzy clan games is introduced. The cores of such games have an interesting shape which inspires to define a class of compensation-sharing rules that are additive and stable on the cone of fuzzy clan games. Further, the notion of bi-monotonic participation allocation scheme (bi-pamas) is introduced and it turns out that each core element of a fuzzy clan game is extend...
متن کاملPebble Games with Algebraic Rules
We define a general framework of partition games for formulating twoplayer pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations of graph isomorphism that is strictly stronger than the well-known Weisfeiler-Lehman method. The general framework we introduce includes as special cases the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Game Theory
سال: 2013
ISSN: 2314-6559
DOI: 10.1155/2013/540487